BSC: Belief Shift Clustering
نویسندگان
چکیده
It is still a challenging problem to characterize uncertainty and imprecision between specific (singleton) clusters with arbitrary shapes sizes. In order solve such problem, we propose belief shift clustering (BSC) method for dealing object data. The BSC considered as the evidential version of mean or mode seeking under theory functions. First, new notion, called shift, provided preliminarily assign each query noise, precise, imprecise one. Second, rule designed partial credal redistribution object. To avoid “uniform effect” useless calculations, dynamic framework simulated cluster centers established reassign singleton related meta-cluster. Once an assigned meta-cluster, this may be in overlapping intermediate areas different clusters. Consequently, can reasonably effectiveness has been verified on several artificial, natural, image segmentation/classification datasets by comparison other methods.
منابع مشابه
Belief Hierarchical Clustering
In the data mining field many clustering methods have been proposed, yet standard versions do not take into account uncertain databases. This paper deals with a new approach to cluster uncertain data by using a hierarchical clustering defined within the belief function framework. The main objective of the belief hierarchical clustering is to allow an object to belong to one or several clusters....
متن کاملMean shift spectral clustering
In recent years there has been a growing interest in clustering methods stemming from the spectral decomposition of the data affinity matrix, which are shown to present good results on a wide variety of situations. However, a complete theoretical understanding of these methods in terms of data distributions is not yet well understood. In this paper, we propose a spectral clustering based mode m...
متن کاملBoosted Mean Shift Clustering
Mean shift is a nonparametric clustering technique that does not require the number of clusters in input and can find clusters of arbitrary shapes. While appealing, the performance of the mean shift algorithm is sensitive to the selection of the bandwidth, and can fail to capture the correct clustering structure when multiple modes exist in one cluster. DBSCAN is an efficient density based clus...
متن کاملNovel Circular-Shift Invariant Clustering
Several important pattern recognition applications are based on feature extraction and vector clustering. Directional patterns may be represented by rotation-variant directional vectors, formed from M features uniformly extracted in M directions. It is often required that pattern recognition algorithms are invariant under pattern rotation or, equivalently, invariant under circular shifts of suc...
متن کاملFinite Alphabet Iterative Decoders, Part I: Decoding Beyond Belief Propagation on BSC
We introduce a new paradigm for finite precision iterative decoding on low-density parity-check codes over the Binary Symmetric channel. The messages take values from a finite alphabet, and unlike traditional quantized decoders which are quantized versions of the Belief propagation (BP) decoder, the proposed finite alphabet iterative decoders (FAIDs) do not propagate quantized probabilities or ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE transactions on systems, man, and cybernetics
سال: 2023
ISSN: ['1083-4427', '1558-2426']
DOI: https://doi.org/10.1109/tsmc.2022.3205365